runtime.sudog.next (field)

50 uses

	runtime (current package)
		chan.go#L757: 	sgp.next = nil
		chan.go#L766: 	x.next = sgp
		chan.go#L776: 		y := sgp.next
		chan.go#L783: 			sgp.next = nil // mark as removed (see dequeueSudoG)
		mgc.go#L1662: 		sgnext = sg.next
		mgc.go#L1663: 		sg.next = nil
		proc.go#L430: 			sched.sudogcache = s.next
		proc.go#L431: 			s.next = nil
		proc.go#L459: 	if s.next != nil {
		proc.go#L488: 				last.next = p
		proc.go#L493: 		last.next = sched.sudogcache
		runtime2.go#L362: 	next *sudog
		select.go#L602: 	y := sgp.next
		select.go#L606: 			x.next = y
		select.go#L608: 			sgp.next = nil
		select.go#L613: 		x.next = nil
		select.go#L622: 		sgp.next = nil
		sema.go#L249: 	s.next = nil
		sema.go#L264: 				s.next = t.next
		sema.go#L268: 				if s.next != nil {
		sema.go#L269: 					s.next.parent = s
		sema.go#L279: 				t.next = nil
		sema.go#L297: 			pt = &t.next
		sema.go#L321: 			if s.parent.next != s {
		sema.go#L343: 			ps = &s.next
		sema.go#L362: 		t.next = s.next
		sema.go#L363: 		if t.next != nil {
		sema.go#L364: 			t.next.parent = t
		sema.go#L376: 		for s.next != nil || s.prev != nil {
		sema.go#L377: 			if s.next == nil || s.prev != nil && s.prev.ticket < s.next.ticket {
		sema.go#L388: 				s.parent.next = nil
		sema.go#L396: 	s.next = nil
		sema.go#L407: 	y := x.next
		sema.go#L412: 	x.next = b
		sema.go#L423: 		if p.next != x {
		sema.go#L426: 		p.next = y
		sema.go#L436: 	b := x.next
		sema.go#L438: 	x.next = y
		sema.go#L451: 		if p.next != y {
		sema.go#L454: 		p.next = x
		sema.go#L524: 		l.tail.next = s
		sema.go#L560: 		next := s.next
		sema.go#L561: 		s.next = nil
		sema.go#L602: 	for p, s := (*sudog)(nil), l.head; s != nil; p, s = s, s.next {
		sema.go#L604: 			n := s.next
		sema.go#L606: 				p.next = n
		sema.go#L614: 			s.next = nil